Polynomial Coefficient Enumeration
نویسندگان
چکیده
Let f(x1, . . . , xk) be a polynomial over a field K. This paper considers such questions as the enumeration of the number of nonzero coefficients of f or of the number of coefficients equal to α ∈ K∗. For instance, if K = Fq then a matrix formula is obtained for the number of coefficients of fn that are equal to α ∈ Fq , as a function of n. Many additional results are obtained related to such areas as lattice path enumeration and the enumeration of integer points in convex polytopes.
منابع مشابه
Counting Quiver Representations over Finite Fields Via Graph Enumeration
Let Γ be a quiver on n vertices v1, v2, . . . , vn with gij edges between vi and vj , and let α ∈ Nn. Hua gave a formula for AΓ(α, q), the number of isomorphism classes of absolutely indecomposable representations of Γ over the finite field Fq with dimension vector α. Kac showed that AΓ(α, q) is a polynomial in q with integer coefficients. Using Hua’s formula, we show that for each integer s ≥ ...
متن کاملCoset Enumeration of Symmetrically Generated Groups Using Gröbner Bases
A new method for coset enumeration in symmetrically generated groups is presented. This method is based on a Gröbner bases algorithm applied to polynomials in non-commuting variables with integer coefficients. Mathematics Subject Classification: 05A05; 20B05; 20B40
متن کاملInterlace Polynomials: Enumeration, Unimodality, and Connections to Codes
The interlace polynomial q was introduced by Arratia, Bollobás, and Sorkin. It encodes many properties of the orbit of a graph under edge local complementation (ELC). The interlace polynomial Q, introduced by Aigner and van der Holst, similarly contains information about the orbit of a graph under local complementation (LC). We have previously classified LC and ELC orbits, and now give an enume...
متن کاملRobust Shortest Path Problems with Two Uncertain Multiplicative Cost Coefficients
We consider a robust shortest path problem when the cost coefficient is the product of two uncertain factors. We first show that the robust problem can be solved in polynomial time by a dual variable enumeration with shortest path problems as subproblems. We also propose a path enumeration approach using a K-shortest paths finding algorithm that may be efficient in many real cases. An applicati...
متن کاملOn the Basis Polynomials in the Theory of Permutations with Prescribed Up-down Structure
We study the polynomials which enumerate the permutations π = (π1, π2, . . . , πn) of the elements 1.2, . . . , n with the condition π1 < π2 < . . . < πn−m(or π1 > π2 > . . . > πn−m) and prescribed up-down points n−m,n−m+1, . . . , n− 1 in view of an important role of these polynomials in theory of enumeration the permutations with prescribed up-down structure similar to the role of the binomia...
متن کامل